Maximal Sublattices of Nite Distributive Lattices
نویسندگان
چکیده
Algebraic properties of lattices of quotients of nite posets are considered. Using the known duality between the category of all nite posets together with all order-preserving maps and the category of all nite distributive (0; 1)-lattices together with all (0; 1)-lattice ho-momorphisms, algebraic and arithmetic properties of maximal proper sublattices and, in particular, Frattini sublattices of nite distributive (0; 1)-lattices are thereby obtained.
منابع مشابه
Maximal Sublattices and Frattini Sublattices of Bounded Lattices
We will address these questions in order, and provide good partial answers, especially for nite lattices which are bounded homomorphic images of a free lattice. Recall that a nite lattice is bounded if and only if it can be obtained from the one element lattice by a sequence of applications of Alan Day's doubling construction for intervals. In particular, nite distributive lattices are bounded....
متن کاملIsotone Maps as Maps of Congruences
Let L be a lattice and let L1, L2 be sublattices of L. Let be a congruence relation of L1. We extend to L by taking the smallest congruence of L containing . Then we restrict to L2, obtaining the congruence L2 of L2. Thus we have de ned a map ConL1 ! ConL2. Obviously, this is an isotone 0-preservingmap of the nite distributive lattice ConL1 into the nite distributive lattice ConL2. The main res...
متن کاملOn maximal sublattices of finite lattices
We discuss the possible structures for and mutual relationships between a finite distributive lattice L, a maximal sublattice M of L and the corresponding ‘remainder’ R = L\M with the aid of Birkhoff duality, and contrast the results with the analogous situations for a general finite lattice L. @ 1999 Elsevier Science B.V. All rights reserved
متن کاملA characterization of neutral elements by the exclusion of sublattices
The main result of this paper gives a characterization of neutral elements in lattices by the exclusion of seventeen types of sublattices containing it. The proof involves several generalizations of distributive, standard and neutral elements in lattices which are introduced using certain modular identities. c © 2008 Elsevier B.V. All rights reserved.
متن کاملMaximal Sublattices of Finite Distributive Lattices. III: A Conjecture from the 1984 Banff Conference on Graphs and Order
Let L be a finite distributive lattice. Let Sub0(L) be the lattice {S | S is a sublattice of L} ∪ {∅} and let ∗[Sub0(L)] be the length of the shortest maximal chain in Sub0(L). It is proved that if K and L are non-trivial finite distributive lattices, then ∗[Sub0(K × L)] = ∗[Sub0(K)] + ∗[Sub0(L)]. A conjecture from the 1984 Banff Conference on Graphs and Order is thus proved. 1 Motivation Let L...
متن کامل